Non-crossing trees revisited: cutting down and spanning subtrees
نویسنده
چکیده
Here we consider two parameters for random non-crossing trees: i the number of random cuts to destroy a sizen non-crossing tree and ii the spanning subtree-size of p randomly chosen nodes in a size-n non-crossing tree. For both quantities, we are able to characterise for n ∞ the limiting distributions. Non-crossing trees are almost conditioned Galton-Watson trees, and it has been already shown, that the contour and other usually associated discrete excursions converge, suitable normalised, to the Brownian excursion. We can interpret parameter ii as a functional of a conditioned random walk, and although we do not have such an interpretation for parameter i , we obtain here limiting distributions, that are also arising as limits of some functionals of conditioned random walks.
منابع مشابه
Cutting down and pollarding of forest trees as perceived by local and governmental forest stakeholders and the impact of changes in fuel source on the forest (Case study: Sarvabad city forests)
Local people are always dependent on cutting down and pollarding of Zagros forests trees to provide their livelihoods needs such as house heating, cooking, supply of livestock forage and building materials. The stakeholders also have many conflicts in terms of forest utilization, which is the main cause of many irregularities in the forest management. The present study was conducted to investig...
متن کاملOn Non-crossing (Projected) Spanning Trees of 3D point sets
We study the problem of optimizing the spanning tree of a set of points in IR3, whose projection onto a given plane contains no crossing edges. Denoted by NCMST (which stands for non-crossing minimum spanning trees), this problem is defined as follows. Given a set of points P in IR and a plane F , find a spanning tree whose projection onto F contains no crossing edges and its length is minimum ...
متن کاملLower bounds on the maximum number of non-crossing acyclic graphs
This paper is a contribution to the problem of counting geometric graphs on point sets. More concretely, we look at the maximum numbers of non-crossing spanning trees and forests. We show that the so-called double chain point configuration of N points has Ω(12.52 ) noncrossing spanning trees and Ω(13.61 ) non-crossing forests. This improves the previous lower bounds on the maximum number of non...
متن کاملAsymptotic Cost of Cutting Down Random Free Trees
In this work, we calculate the limit distribution of the total cost incurred by splitting a tree selected at random from the set of all finite free trees. This total cost is considered to be an additive functional induced by a toll equal to the square of the size of tree. The main tools used are the recent results connecting the asymptotics of generating functions with the asymptotics of...
متن کاملiETA #1 Improved Fixed-Parameter Algorithms for Non-Crossing Subgraphs1
We consider the problem of computing non-crossing spanning trees in topological graphs. It is known that it is NP-hard to decide whether a topological graph has a noncrossing spanning tree, and that it is hard to approximate the minimum number of crossings in a spanning tree. We give improved fixed-parameter algorithms, where we use the number k of crossing edge pairs and the number μ of crossi...
متن کامل